Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar16/TRCSRSLASHEx4_7_56_Bor03

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(from₁(X)) -> FROM₁(s₁(X))
PROPER₁(from₁(X)) -> FROM₁(proper₁(X))
TOP₁(mark₁(X)) -> PROPER₁(X)
PROPER₁(after₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(after₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(from₁(X)) -> FROM₁(active₁(X))
ACTIVE₁(after₂(X1, X2)) -> ACTIVE₁(X2)
S₁(mark₁(X)) -> S₁(X)
AFTER₂(X1, mark₁(X2)) -> AFTER₂(X1, X2)
ACTIVE₁(after₂(s₁(N), cons₂(X, XS))) -> AFTER₂(N, XS)
PROPER₁(after₂(X1, X2)) -> AFTER₂(proper₁(X1), proper₁(X2))
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))
PROPER₁(s₁(X)) -> S₁(proper₁(X))
AFTER₂(ok₁(X1), ok₁(X2)) -> AFTER₂(X1, X2)
S₁(ok₁(X)) -> S₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(from₁(X)) -> CONS₂(X, from₁(s₁(X)))
CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)
ACTIVE₁(cons₂(X1, X2)) -> CONS₂(active₁(X1), X2)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
FROM₁(mark₁(X)) -> FROM₁(X)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(after₂(X1, X2)) -> AFTER₂(X1, active₁(X2))
ACTIVE₁(after₂(X1, X2)) -> AFTER₂(active₁(X1), X2)
AFTER₂(mark₁(X1), X2) -> AFTER₂(X1, X2)
TOP₁(ok₁(X)) -> ACTIVE₁(X)
ACTIVE₁(after₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> S₁(X)
ACTIVE₁(s₁(X)) -> S₁(active₁(X))
PROPER₁(cons₂(X1, X2)) -> CONS₂(proper₁(X1), proper₁(X2))
PROPER₁(s₁(X)) -> PROPER₁(X)
TOP₁(ok₁(X)) -> TOP₁(active₁(X))
PROPER₁(from₁(X)) -> PROPER₁(X)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
FROM₁(ok₁(X)) -> FROM₁(X)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(from₁(X)) -> FROM₁(s₁(X))
PROPER₁(from₁(X)) -> FROM₁(proper₁(X))
TOP₁(mark₁(X)) -> PROPER₁(X)
PROPER₁(after₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(after₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(from₁(X)) -> FROM₁(active₁(X))
ACTIVE₁(after₂(X1, X2)) -> ACTIVE₁(X2)
S₁(mark₁(X)) -> S₁(X)
AFTER₂(X1, mark₁(X2)) -> AFTER₂(X1, X2)
ACTIVE₁(after₂(s₁(N), cons₂(X, XS))) -> AFTER₂(N, XS)
PROPER₁(after₂(X1, X2)) -> AFTER₂(proper₁(X1), proper₁(X2))
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))
PROPER₁(s₁(X)) -> S₁(proper₁(X))
AFTER₂(ok₁(X1), ok₁(X2)) -> AFTER₂(X1, X2)
S₁(ok₁(X)) -> S₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(from₁(X)) -> CONS₂(X, from₁(s₁(X)))
CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)
ACTIVE₁(cons₂(X1, X2)) -> CONS₂(active₁(X1), X2)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
FROM₁(mark₁(X)) -> FROM₁(X)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(after₂(X1, X2)) -> AFTER₂(X1, active₁(X2))
ACTIVE₁(after₂(X1, X2)) -> AFTER₂(active₁(X1), X2)
AFTER₂(mark₁(X1), X2) -> AFTER₂(X1, X2)
TOP₁(ok₁(X)) -> ACTIVE₁(X)
ACTIVE₁(after₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> S₁(X)
ACTIVE₁(s₁(X)) -> S₁(active₁(X))
PROPER₁(cons₂(X1, X2)) -> CONS₂(proper₁(X1), proper₁(X2))
PROPER₁(s₁(X)) -> PROPER₁(X)
TOP₁(ok₁(X)) -> TOP₁(active₁(X))
PROPER₁(from₁(X)) -> PROPER₁(X)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
FROM₁(ok₁(X)) -> FROM₁(X)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 7 SCCs with 15 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

AFTER₂(ok₁(X1), ok₁(X2)) -> AFTER₂(X1, X2)
AFTER₂(mark₁(X1), X2) -> AFTER₂(X1, X2)
AFTER₂(X1, mark₁(X2)) -> AFTER₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

AFTER₂(ok₁(X1), ok₁(X2)) -> AFTER₂(X1, X2)

The remaining pairs can at least by weakly be oriented.

AFTER₂(mark₁(X1), X2) -> AFTER₂(X1, X2)
AFTER₂(X1, mark₁(X2)) -> AFTER₂(X1, X2)

Used ordering: Combined order from the following AFS and order.
AFTER₂(x1, x2) = AFTER₁(x2)
ok₁(x1) = ok₁(x1)
mark₁(x1) = x1

Lexicographic Path Order [19].
Precedence:

ok₁ > AFTER₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

AFTER₂(mark₁(X1), X2) -> AFTER₂(X1, X2)
AFTER₂(X1, mark₁(X2)) -> AFTER₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

AFTER₂(mark₁(X1), X2) -> AFTER₂(X1, X2)

The remaining pairs can at least by weakly be oriented.

AFTER₂(X1, mark₁(X2)) -> AFTER₂(X1, X2)

Used ordering: Combined order from the following AFS and order.
AFTER₂(x1, x2) = AFTER₁(x1)
mark₁(x1) = mark₁(x1)

Lexicographic Path Order [19].
Precedence:

[AFTER₁, mark_1]

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

AFTER₂(X1, mark₁(X2)) -> AFTER₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

AFTER₂(X1, mark₁(X2)) -> AFTER₂(X1, X2)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
AFTER₂(x1, x2) = AFTER₁(x2)
mark₁(x1) = mark₁(x1)

Lexicographic Path Order [19].
Precedence:

[AFTER₁, mark_1]

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S₁(ok₁(X)) -> S₁(X)
S₁(mark₁(X)) -> S₁(X)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

S₁(mark₁(X)) -> S₁(X)

The remaining pairs can at least by weakly be oriented.

S₁(ok₁(X)) -> S₁(X)

Used ordering: Combined order from the following AFS and order.
S₁(x1) = S₁(x1)
ok₁(x1) = x1
mark₁(x1) = mark₁(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S₁(ok₁(X)) -> S₁(X)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

S₁(ok₁(X)) -> S₁(X)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
S₁(x1) = S₁(x1)
ok₁(x1) = ok₁(x1)

Lexicographic Path Order [19].
Precedence:

ok₁ > S₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)
CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)

The remaining pairs can at least by weakly be oriented.

CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)

Used ordering: Combined order from the following AFS and order.
CONS₂(x1, x2) = x2
mark₁(x1) = mark
ok₁(x1) = ok₁(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
CONS₂(x1, x2) = CONS₁(x1)
mark₁(x1) = mark₁(x1)

Lexicographic Path Order [19].
Precedence:

[CONS₁, mark_1]

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FROM₁(mark₁(X)) -> FROM₁(X)
FROM₁(ok₁(X)) -> FROM₁(X)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

FROM₁(ok₁(X)) -> FROM₁(X)

The remaining pairs can at least by weakly be oriented.

FROM₁(mark₁(X)) -> FROM₁(X)

Used ordering: Combined order from the following AFS and order.
FROM₁(x1) = FROM₁(x1)
mark₁(x1) = x1
ok₁(x1) = ok₁(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FROM₁(mark₁(X)) -> FROM₁(X)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

FROM₁(mark₁(X)) -> FROM₁(X)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
FROM₁(x1) = FROM₁(x1)
mark₁(x1) = mark₁(x1)

Lexicographic Path Order [19].
Precedence:

mark₁ > FROM₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(after₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(from₁(X)) -> PROPER₁(X)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(after₂(X1, X2)) -> PROPER₁(X1)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

PROPER₁(after₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(after₂(X1, X2)) -> PROPER₁(X1)

The remaining pairs can at least by weakly be oriented.

PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(from₁(X)) -> PROPER₁(X)

Used ordering: Combined order from the following AFS and order.
PROPER₁(x1) = x1
after₂(x1, x2) = after₂(x1, x2)
s₁(x1) = x1
from₁(x1) = x1
cons₂(x1, x2) = cons₂(x1, x2)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(from₁(X)) -> PROPER₁(X)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

PROPER₁(from₁(X)) -> PROPER₁(X)

The remaining pairs can at least by weakly be oriented.

PROPER₁(s₁(X)) -> PROPER₁(X)

Used ordering: Combined order from the following AFS and order.
PROPER₁(x1) = PROPER₁(x1)
s₁(x1) = x1
from₁(x1) = from₁(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(s₁(X)) -> PROPER₁(X)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

PROPER₁(s₁(X)) -> PROPER₁(X)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
PROPER₁(x1) = PROPER₁(x1)
s₁(x1) = s₁(x1)

Lexicographic Path Order [19].
Precedence:

s₁ > PROPER₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(after₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(after₂(X1, X2)) -> ACTIVE₁(X1)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

ACTIVE₁(after₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(after₂(X1, X2)) -> ACTIVE₁(X1)

The remaining pairs can at least by weakly be oriented.

ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)

Used ordering: Combined order from the following AFS and order.
ACTIVE₁(x1) = x1
cons₂(x1, x2) = x1
from₁(x1) = x1
s₁(x1) = x1
after₂(x1, x2) = after₂(x1, x2)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)

The remaining pairs can at least by weakly be oriented.

ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)

Used ordering: Combined order from the following AFS and order.
ACTIVE₁(x1) = ACTIVE₁(x1)
cons₂(x1, x2) = cons₁(x1)
from₁(x1) = x1
s₁(x1) = x1

Lexicographic Path Order [19].
Precedence:

[ACTIVE₁, cons_1]

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

ACTIVE₁(s₁(X)) -> ACTIVE₁(X)

The remaining pairs can at least by weakly be oriented.

ACTIVE₁(from₁(X)) -> ACTIVE₁(X)

Used ordering: Combined order from the following AFS and order.
ACTIVE₁(x1) = ACTIVE₁(x1)
from₁(x1) = x1
s₁(x1) = s₁(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(from₁(X)) -> ACTIVE₁(X)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

ACTIVE₁(from₁(X)) -> ACTIVE₁(X)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
ACTIVE₁(x1) = ACTIVE₁(x1)
from₁(x1) = from₁(x1)

Lexicographic Path Order [19].
Precedence:

from₁ > ACTIVE₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ PisEmptyProof

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

TOP₁(ok₁(X)) -> TOP₁(active₁(X))
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(after₂(0, XS)) -> mark₁(XS)
active₁(after₂(s₁(N), cons₂(X, XS))) -> mark₁(after₂(N, XS))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(after₂(X1, X2)) -> after₂(active₁(X1), X2)
active₁(after₂(X1, X2)) -> after₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
after₂(mark₁(X1), X2) -> mark₁(after₂(X1, X2))
after₂(X1, mark₁(X2)) -> mark₁(after₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(after₂(X1, X2)) -> after₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
after₂(ok₁(X1), ok₁(X2)) -> ok₁(after₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.